Stabilization of Quantum Computations by Symmetrization
نویسندگان
چکیده
We propose a method for the stabilization of quantum computations (including quantum state storage). The method is based on the operation of projection into SYM, the symmetric subspace of the full state space of R redundant copies of the computer. We describe an efficient algorithm and quantum network effecting SYM–projection and discuss the stabilizing effect of the proposed method in the context of unitary errors generated by hardware imprecision, and nonunitary errors arising from external environmental interaction. Finally, limitations of the method are discussed.
منابع مشابه
ua nt - p h / 99 07 02 8 v 1 8 J ul 1 99 9 Testing the symmetrization postulate of quantum mechanics and the spin - statistics connection Guglielmo
Recent experimental tests of the symmetrization postulate of quantum mechanics are discussed. It is shown that in a strict sense these experiments cannot test the validity of the symmetrization postulate, but in most cases do test the spin-statistics connection. An experiment is proposed that would allow to search for possible violations of the symmetrization postulate. Typeset using REVTEX 1
متن کاملSymmetrization, quantum images and measurement
We argue that symmetrization of an incoming microstate with similar states in a sea of microstates contained in a macroscopic detector can produce an effective image, which does not contradict the no-cloning theorem, and such a combinatorial set can then be used with first passage random walk interactions suggested in an earlier work to give the right quantum mechanical weight for measured eige...
متن کاملDecoherence suppression for oscillator-assisted geometric quantum gates via symmetrization
We propose a novel symmetrization procedure to beat decoherence for oscillator-assisted quantum gate operations. The enacted symmetry is related to the global geometric features of qubits transformation based on ancillary oscillator modes, e.g. phonons in an ion-trap system. It is shown that the devised multi-circuit symmetrized evolution endows the system with a two-fold resilience against dec...
متن کاملExtending Robustness and Randomization from Consensus to Symmetrization Algorithms
This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite group. We show how the symmetrization framework we develop covers applications as diverse as consensus on probability distributions (either classical or quantum), uniform random state generation, and open-loop disturbance...
متن کاملFrom Consensus to Robust Randomized Algorithms: A Symmetrization Approach
This paper interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization with respect to the actions of a finite group. Explicit convergence results are provided in a grouptheoretic formulation, both for deterministic and for stochastic dynamics. We show how the symmetrization framework directly extends the scope of consensustype algorithms and results to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 26 شماره
صفحات -
تاریخ انتشار 1997